On specifying Boolean functions by labelled examples
نویسندگان
چکیده
منابع مشابه
On Specifying Boolean Functions by Labelled Examples
We say a function t in a set H of {0, 1}-valued functions defined on a set X is specified by S ⊆ X if the only function in H which agrees with t on S is t itself. The specification number of t is the least cardinality of such an S. For a general finite class of functions, we show that the specification number of any function in the class is at least equal to a parameter from [21] known as the t...
متن کاملExamples Sheet, Analysis of Boolean Functions
n 2 and X is a finite set unless otherwise stated. Answers and comments on some of the questions appear at the end. 1. Prove the nesting of the L p (X)-norms and p (X)-norms. Show that in the first case equality holds if and only if the function is constant, and in the latter if and only if the function is a δ-function, meaning that it is supported on exactly one point of the domain.
متن کاملOn canalizing Boolean functions
Boolean networks are an important model of gene regulatory networks in systems and computational biology. Such networks have been widely studied with respect to their stability and error tolerance. It has turned out that canalizing Boolean functions and their subclass, the nested canalizing functions, appear frequently in such networks. These classes have been shown to have a stabilizing effect...
متن کاملApproximating Boolean Functions by OBDDs
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximating Boolean functions with respect to given distributions on the inputs. We present a new type of reduction for one–round communication problems that is suitable for approximations. Using this new type of reduction, we ...
متن کاملThe influence of opposite examples and randomness on the generalization complexity of Boolean functions
We analyze Boolean functions using a recently proposed measure of their complexity. This complexity measure, motivated by the aim of relating the complexity of the functions with the generalization ability that can be obtained when the functions are implemented in feed-forward neural networks, is the sum of two components. The first of these is related to the ‘average sensitivity’ of the functi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00007-z